The minimum weakly connected independent set problem: Polyhedral results and Branch–and–Cut
نویسندگان
چکیده
منابع مشابه
Algorithms for Minimum m -Connected k -Dominating Set Problem
In wireless sensor networks, virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we consid...
متن کاملOn the Complexity of the Minimum Independent Set Partition Problem
We consider the Minimum Independent Set Partition Problem (MISP) and its dual (MISPDual). The input is a multi-set of N vectors from {0, 1}, where U := {1, . . . , n} is the index set. In MISP, a threshold k is given and the goal is to partition U into a minimum number of subsets such that the projected vectors on each subset of indices has multiplicity at least k, where the multiplicity is the...
متن کاملAlgorithms for minimum m-connected k-tuple dominating set problem
In wireless sensor networks, a virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we cons...
متن کاملOn minimum connected dominating set problem in unit-ball graphs
Given a graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D such that its induced subgraph is connected and each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper proposes a constant-ratio approximation a...
متن کاملWeakly quasi-Hamiltonian-set-connected multipartite tournaments
A multipartite or c-partite tournament is an orientation of a complete c-partite graph. Lu and Guo (submitted for publication) [3] recently introduced strong quasi-Hamiltonianconnectivity of a multipartite tournament D as follows: For any two distinct vertices x and y ofD, there is a pathwith at least one vertex from each partite set ofD from x to y and from y to x. We obtain the definition for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2016
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2016.04.006